An Efficient Searching Algorithm for Approximate Nearest Neighbor Queries in High Dimensions
نویسندگان
چکیده
In this papel; we present an approximate nearest neighbor search algorithm that use heuristics to decide whether o r not to access a node in the index tree based on three interesting data distribution properties. We demonstrate that the proposed algorithm significantly reduces the number of nodes accessed over the algorithms that have been proposed in earlier works. Also, it will be demonstrated in this paper that the proposed algorithm can retain close to 100% of the K nearest neighbors in most cases.
منابع مشابه
Approximate Nearest Neighbor Queries among Parallel Segments
We develop a data structure for answering efficiently approximate nearest neighbor queries over a set of parallel segments in three dimensions. We connect this problem to approximate nearest neighbor searching under weight constraints and approximate nearest neighbor searching on historical data in any dimension and give efficient solutions for these as well.
متن کاملThe Analysis of a Probabilistic Approach to Nearest Neighbor Searching
Given a set S of n data points in some metric space. Given a query point q in this space, a nearest neighbor query asks for the nearest point of S to q. Throughout we will assume that the space is real d-dimensional space <d, and the metric is Euclidean distance. The goal is to preprocess S into a data structure so that such queries can be answered efficiently. Nearest neighbor searching has ap...
متن کاملΕ-isa: an Incremental Lower Bound Approach for Efficiently Finding Approximate Nearest Neighbor of Complex Vague Queries
In our context, a complex vague query means a multifeature nearest neighbor query. Answering such queries requires the system to search on some feature spaces individually and then combine the searching results to find the final answers. The feature spaces are commonly multidimensional spaces and may consist of a vast amount of data. Therefore searching costs, including IO-cost and CPU-cost, ar...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملApproximate Nearest Neighbor Queries in Fixed Dimensions 1
Given a set of n points in d-dimensional Euclidean space, S E d , and a query point q 2 E d , we wish to determine the nearest neighbor of q, that is, the point of S whose Euclidean distance to q is minimum. The goal is to preprocess the point set S, such that queries can be answered as eeciently as possible. We assume that the dimension d is a constant independent of n. Although reasonably goo...
متن کامل